On Eco-Grammar Systems and Artificial Neural Networks

Eco-grammar systems and artiicial neural networks have many common features: massive parallelism, independently working elements (agents/neurons), cooperation of the elements and, not least, universal computational power (at least as that of Turing Machine). We prove the possibility to simulate each step of the one type system by the xed number of steps of the another type one without loss of the parallelism. Moreover, number of processing elements (neurons, agents) of the model is a function of class O(n), where n is a number of processing elements of the original system.